package leetcode.周赛.双周赛.第67场;

import org.junit.Test;

import java.util.*;

/**
 * @author ：zsy
 * @date ：Created 2021/12/11 23:39
 * @description：
 */
public class 找到和最大的长度为K的子序列 {
    @Test
    public void test() {
        Solution solution = new Solution();
        System.out.println(Arrays.toString(solution.maxSubsequence(new int[]{-56,-214,-345,952,529,-294,-325,-924,-27,-41,716,-67,-65,-481}, 5)));
    }


    class Solution {
        public int[] maxSubsequence(int[] nums, int k) {
            return nums;
        }
    }
}
